Alternating Strategies Are Good For Low-Rank Matrix Reconstruction
نویسندگان
چکیده
This article focuses on the problem of reconstructing low-rank matrices from underdetermined measurements using alternating optimization strategies. We endeavour to combine an alternating least-squares based estimation strategy with ideas from the alternating direction method of multipliers (ADMM) to recover structured low-rank matrices, such as Hankel structure. We show that merging these two alternating strategies leads to a better performance than the existing alternating least squares (ALS) strategy. The performance is evaluated via numerical simulations.
منابع مشابه
Alternating strategies with internal ADMM for low-rank matrix reconstruction
This paper focuses on the problem of reconstructing low-rank matrices from underdetermined measurements using alternating optimization strategies. We endeavour to combine an alternating least-squares based estimation strategy with ideas from the alternating direction method of multipliers (ADMM) to recover low-rank matrices with linear parameterized structures, such as Hankel matrices. The use ...
متن کاملParallel matrix factorization for low-rank tensor completion
Higher-order low-rank tensors naturally arise in many applications including hyperspectral data recovery, video inpainting, seismic data reconstruction, and so on. We propose a new model to recover a low-rank tensor by simultaneously performing low-rank matrix factorizations to the all-mode matricizations of the underlying tensor. An alternating minimization algorithm is applied to solve the mo...
متن کاملEfficient l1-Norm-Based Low-Rank Matrix Approximations for Large-Scale Problems Using Alternating Rectified Gradient Method
Low-rank matrix approximation plays an important role in the area of computer vision and image processing. Most of the conventional low-rank matrix approximation methods are based on the l2 -norm (Frobenius norm) with principal component analysis (PCA) being the most popular among them. However, this can give a poor approximation for data contaminated by outliers (including missing data), becau...
متن کاملEnhanced Matrix Completion with Manifold Learning
We study the problem of matrix completion when information about row or column proximities is available, in the form of weighted graphs. The problem can be formulated as the optimization of a convex function that can be solved efficiently using the alternating direction multipliers method. Experiments show that our model offers better reconstruction than the standard method that only uses a low...
متن کاملTensor completion based on nuclear norm minimization for 5D seismic data reconstruction
Prestack seismic data are multidimensional signals that can be described as a low-rank fourth-order tensor in the frequency − space domain. Tensor completion strategies can be used to recover unrecorded observations and to improve the signal-to-noise ratio of prestack volumes. Additionally, tensor completion can be posed as an inverse problem and solved using convex optimization algorithms. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1407.3410 شماره
صفحات -
تاریخ انتشار 2014